Can One Hear a Matrix? Recovering a Real Symmetric Matrix from Its Spectral Data

نویسندگان

چکیده

Abstract The spectrum of a real and symmetric $$N\times N$$ N × matrix determines the up to unitary equivalence. More spectral data is needed together with some sign indicators remove ambiguities. In first part this work, we specify information required for unique reconstruction general matrices. specifically, consists spectra N nested main minors original sizes $$1,2,\ldots ,N$$ 1 , 2 … . However, due complicated nature data, improvements are in order make procedure feasible. With mind, second restricted banded matrices where amount exceeds number unknown entries. It shown that one can take advantage redundancy guarantee generic matrices; other words, subset open, dense full measure set real, optimize ratio between genericity by using freedom choice input. We demonstrate our constructions detail pentadiagonal

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX

The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...

متن کامل

Spectral Aspects of Symmetric Matrix Signings∗

The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of finding symmetric signings of matrices with natural spectral properties. Our results are the following: 1. We characterize matrices that have an invertible signing: a symmetric matrix has an invertible symmetric signing if...

متن کامل

Constructing a Unitary Hessenberg Matrix from Spectral Data

We consider the numerical construction of a unitary Hessenberg matrix from spectral data using an inverse QR algorithm. Any unitary upper Hessenberg matrix H with nonnegative subdiagonal elements can be represented by 2n ? 1 real parameters. This representation, which we refer to as the Schur parameterization of H; facilitates the development of eecient algorithms for this class of matrices. We...

متن کامل

A Takagi Factorization of a Real Symmetric Tridiagonal Matrix

Complex symmetric matrices arise from many applications, such as chemical exchange in nuclear magnetic resonance and power systems. Singular value decomposition (SVD) reveals a great deal of properties of a matrix. A complex symmetric matrix has a symmetric SVD (SSVD), also called Takagi Factorization, which exploits the symmetry [3]. Let A be a complex symmetric matrix, its Takagi factorizatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales Henri Poincaré

سال: 2021

ISSN: ['1424-0661', '1424-0637']

DOI: https://doi.org/10.1007/s00023-021-01135-z